package com.gitee.swsk33.algorithms.introduction;

/**
 * 时间复杂度估计
 */
public class TimeComplexity {

	private static int sumMatrix(int[][] matrix) {
		int result = 0;
		for (int[] ints : matrix) {
			for (int anInt : ints) {
				result = result + anInt;
			}
		}
		return result;
	}

	public static void main(String[] args) {
		System.out.println("字节型：" + Byte.SIZE / 8);
		System.out.println("短整型：" + Short.SIZE / 8);
		System.out.println("整型：" + Integer.SIZE / 8);
		System.out.println("长整型：" + Long.SIZE / 8);
		System.out.println("浮点型：" + Float.SIZE / 8);
		System.out.println("双精度浮点型：" + Double.SIZE / 8);
		System.out.println("字符型：" + Character.SIZE / 8);
	}

}